simplex algorithm造句
例句與造句
- On the simplex algorithm with largest improvement rule
關(guān)于使用最大改進(jìn)規(guī)則的單純形算法 - Solving loader problem by using simplex algorithm
單純形法解裝卸工問(wèn)題 - Computer resolving method of simplex algorithms in linear programming
線性規(guī)劃問(wèn)題中單純形法的計(jì)算機(jī)求解 - On the basis of this methods , many scholars studied simplex algorithm of fuzzy linear programming
對(duì)此許多學(xué)者給出了它的簡(jiǎn)捷算法。不過(guò)這必須滿足一定條件。 - The new algorithm has not only the global of genetic algorithm , but also the fast convergence of the simplex algorithm
該新算法既具有遺傳算法的全局收斂性，又具有單純形法的快速收斂性。 - It's difficult to find simplex algorithm in a sentence. 用simplex algorithm造句挺難的
- The time lag between the direct wave and the scattered wave could be computed by using the simplex algorithm method
當(dāng)彎曲波在傳遞時(shí)遇到平板裂縫則會(huì)產(chǎn)生散射波，因此含有裂縫平板的板波訊號(hào)即包括彎曲波的直接波傳與裂縫引起的散射波傳。 - In this paper we improve the simplex algorithm for quadratic programs , from algorithm to convergence conditions , and get simpler procedure and converging rules
摘要本文對(duì)二次規(guī)劃的單純形算法，從算法到收斂條件均加以改進(jìn)，得到更簡(jiǎn)易的程序和收斂準(zhǔn)則。 - Kalai , gil . " a subexponential randomized simplex algorithm ( extended abstract ) . " in proceedings of the 24th annual association for computing machinery symposium on theory of computing . new york , ny : acm press , 1992
一種亞指數(shù)隨機(jī)化的簡(jiǎn)單型法（擴(kuò)展摘要） ， 《第24屆計(jì)算理論的機(jī)器計(jì)算年會(huì)公報(bào)》 ，紐約， ny ： acm出版， 1992 。 - At last , a method to fuzzy linear programming with fuzzy constraints is presented , and it is illustrated that the conclusion of this paper are correct and this algorithm is more simplex algorithm by numerical example
最后給出了約束條件帶有模糊性的模糊線性規(guī)劃的相應(yīng)解法，并用實(shí)例說(shuō)明了本文結(jié)論的正確性與算法的簡(jiǎn)捷性。 - The most dangerous sliding surface and the corresponding minimum safety coefficient of slope stability with soil nail structure are searched by empirical genetic - simplex algorithm . the results obtained by empirical genetic - simplex algorithm are compared with the ones obtained by general genetic algorithm
用經(jīng)驗(yàn)遺傳-單純形算法尋找了土釘支護(hù)結(jié)構(gòu)最危險(xiǎn)滑裂面及其對(duì)應(yīng)的最小安全系數(shù)fsmin ,從而實(shí)現(xiàn)了十分重要但計(jì)算量很大、很繁瑣的尋優(yōu)過(guò)程。 - To the inequality constrained least squares adjustment problem , this paper converts many inequality constraints into one equality constraint by using aggregate function of non - linear programming ; a basic augmented lagrangean algorithm can obtain the solutions for equality constrained non - linear programming problem and the solutions are identical to those obtained by the bayesian method and / or simplex algorithm
摘要對(duì)不等式約束最小二乘平差問(wèn)題，借助非線性規(guī)劃中的凝聚約束方法把多個(gè)不等式約束轉(zhuǎn)化為一個(gè)等式約束，采用拉格朗日極值法求解，解與貝葉斯解或單純形解一致。 - So a lot of researchers have attached importance to optimization computing , and put forward all kinds of algotithms for optimization problems , for instance : simplex algorithm , dynamic programming algorithm , branch - bound algorithm , etc . but these algorithms are all disadvantage and can not be applied to complex nonlinear optimization problems
為了解決各種優(yōu)化計(jì)算問(wèn)題，人們提出了各種各樣的優(yōu)化計(jì)算方法，如單純形法、梯度法、動(dòng)態(tài)規(guī)劃法、分枝剪界法。這些優(yōu)化算法各有各的長(zhǎng)處，各有各的適用范圍，也有各自的限制。 - Biology , etc . owing to many merits has not yet been used to measure parameters of gratings . the paper researches on the subject in view of current lack of it . the main tasks of the paper include : analyzing ellipsometric characteristics of gratings in detail with vector diffraction theory and ellipsometrics ; devising a reflective quarter wave plate at normal incidence according to some ellipsometric characteristics ; making use of normal simplex algorithm during ellipsometric inversion of gratings parameters , inversing ellipsometric parameters with gaussian noise of different standard deviations to simulate actually measured values with examples of isotropic metallic and anisotropic step gratings and testing that ellipsometry about gratings parameters is feasible with the range of certain precision ; discussing choice of incidence angle at length
本論文的主要工作包括：結(jié)合光柵的矢量衍射理論和薄膜的橢偏理論，詳細(xì)分析了光柵的橢偏特性；并且根據(jù)一些橢偏特性設(shè)計(jì)出一款正入射反射型單波長(zhǎng)1 4波片；在光柵參數(shù)的橢偏反演中，引入正單純形法作為反演算法，分別以各向同性的正弦形金屬光柵和各向異性的階梯型光柵為例，在標(biāo)準(zhǔn)橢偏值的基礎(chǔ)上加入不同偏差的高斯噪聲來(lái)模擬實(shí)際的橢偏測(cè)量值進(jìn)行反演，在一定精度范圍內(nèi)得出滿意的光柵參數(shù)，說(shuō)明光柵參數(shù)的橢偏測(cè)量是可行的；還就入射角的選取問(wèn)題進(jìn)行了一定的探討。 - In , we obtain the optimality conditions for quadratic programming ? linear complementarity problem by kuhn - tucker theorem . in , first a pivoting method for linear complementarity problem can be proposed by its feature and the simplex algorithm for linear programming . second we give copositive - plus matrix and invest the finite convergence analysis
在3中，我們考慮到線性互補(bǔ)問(wèn)題的特點(diǎn)，結(jié)合線性規(guī)劃方法，把線性規(guī)劃的單純形法加以適當(dāng)修改，提出了求解線性互補(bǔ)問(wèn)題的轉(zhuǎn)軸方法，接著引入?yún)f(xié)調(diào)正加矩陣的概念，研究了轉(zhuǎn)軸算法的有限收斂性。